FQHT: The Logic of Stable Models for Logic Programs with Intensional Functions
نویسندگان
چکیده
We study a logical system FQHT that is appropriate for reasoning about nonmonotonic theories with intensional functions as treated in the approach of [Bartholomew and Lee, 2012]. We provide a logical semantics, a Gentzen style proof theory and establish completeness results. The adequacy of the approach is demonstrated by showing that it captures the Bartholemew/Lee semantics and satisfies a strong equivalence property.
منابع مشابه
Stable Models of Formulas with Intensional Functions
In classical logic, nonBoolean fluents, such as the location of an object and the color of a ball, can be naturally described by functions, but this is not the case with the traditional stable model semantics, where the values of functions are predefined, and nonmonotonicity of the semantics is related to minimizing the extents of predicates but has nothing to do with functions. We extend the f...
متن کاملLogic Programs with Intensional Functions
The stable model semantics treats a logic program as a mechanism for specifying its intensional predicates. In this paper we discuss a modification of that semantics in which functions, rather than predicates, are intensional. The idea of the new definition comes from nonmonotonic causal logic.
متن کاملLogic Programs with Intensional Functions (Preliminary Report)
The stable model semantics treats a logic program as a mechanism for specifying its intensional predicates. In this note we discuss a modification of that semantics in which functions, rather than predicates, are intensional. The idea of the new definition comes from nonmonotonic causal logic.
متن کاملSymmetric Splitting in the General Theory of Stable Models
Splitting a logic program allows us to reduce the task of computing its stable models to similar tasks for smaller programs. This idea is extended here to the general theory of stable models that replaces traditional logic programs by arbitrary firstorder sentences and distinguishes between intensional and extensional predicates. We discuss two kinds of splitting: a set of intensional predicate...
متن کاملStable Models of Multi-Valued Formulas: Partial vs. Total Functions
Recent extensions of the stable model semantics that allow intensional functions—functions that can be specified by logic programs using other functions and predicates—can be divided into two groups. One group defines a stable model in terms of minimality on the values of partial functions, and the other defines it in terms of uniqueness on the values of total functions. We show that, in the co...
متن کامل